Call  for  papers:  Submit  an  Abstract  for  the  American  Geophysical  Union  Meeting  in   San  Francisco,  December  12-­‐16,  2016,  for  a  session

Source URL: philsci.org

• Academic publishing
• Epistemology of science
• Interpretation
• Scientific modelling
• Abstract management
• Conceptual model
• Climate model
• Abstract

Execution Generated Test Cases: How to Make Systems Code Crash Itself Cristian Cadar and Dawson Engler? Computer Systems Laboratory Stanford University Stanford, CA 94305, U.S.A.

Source URL: www.doc.ic.ac.uk

• Constraint programming
• Abstract interpretation
• Symbolic execution
• Software testing
• Reference
• Constraint satisfaction problem
• Const
• Parameter
• Concolic testing
• Constraint logic programming

TERM EXTRACTION AND RAMSEY’S THEOREM FOR PAIRS ALEXANDER P. KREUZER AND ULRICH KOHLENBACH Abstract. In this paper we study with proof-theoretic methods the function(al)s provably recursive relative to Ramsey’s theore

Source URL: www.mathematik.tu-darmstadt.de

• Proof theory
• Computability theory
• Logic in computer science
• Mathematical logic
• Intuitionism
• Primitive recursive functional
• Dialectica interpretation
• Peano axioms
• Second-order arithmetic
• Reverse mathematics
• Combinatory logic
• Primitive recursive arithmetic

. . Certified Abstract Interpretation with Pretty-Big-Step Semantics

Source URL: ajacs.inria.fr

1 On Various Abstract Understandings of Abstract Interpretation Patrick C OUSOT Courant Institute of Mathematical Sciences

Source URL: cs.nyu.edu

PROOF MINING: A SYSTEMATIC WAY OF ANALYSING PROOFS IN MATHEMATICS ULRICH KOHLENBACH AND PAULO OLIVA Abstract. We call proof mining the process of logically analyzing proofs in mathematics with the aim of obtaining new i

Source URL: www.mathematik.tu-darmstadt.de

• Mathematical logic
• Quantification
• Logic
• Semantics
• Peano axioms
• Symbol
• Constructible universe
• Universal quantification
• Interpretation
• Uniform boundedness principle
• Witness
• Combinatory logic

Tutorial to Locales and Locale Interpretation∗ Clemens Ballarin Abstract Locales are Isabelle’s approach for dealing with parametric theories. They have been designed as a module system for a theorem prover

Source URL: mirror.clarkson.edu

Tutorial to Locales and Locale Interpretation∗ Clemens Ballarin Abstract Locales are Isabelle’s approach for dealing with parametric theories. They have been designed as a module system for a theorem prover

Source URL: isabelle.in.tum.de

THE COMPLEXITY OF SATISFACTION PROBLEMS IN REVERSE MATHEMATICS LUDOVIC PATEY Abstract. Satisfiability problems play a central role in computer science and engineering as a general framework for studying the complexity of

Source URL: ludovicpatey.com

• Automated theorem proving
• Logic programming
• Logic in computer science
• Boolean algebra
• Model theory
• Substitution
• Boolean satisfiability problem
• Interpretation
• Relationships among probability distributions
• Lifting theory

Exploiting 3D Semantic Scene Priors for Online Traffic Light Interpretation Dan Barnes, Will Maddern and Ingmar Posner Abstract— In this paper we present a probabilistic framework for increasing online object detection

Source URL: europa2.informatik.uni-freiburg.de

• Transport
• Land transport
• Road transport
• Traffic law
• Feature detection
• Road traffic management
• Advanced driver assistance systems
• Traffic light
• Global Positioning System
• Histogram of oriented gradients
• Integral Channel Features
• Traffic